A sampling theorem for shift-invariant subspace
نویسندگان
چکیده
A sampling theorem for regular sampling in shift invariant subspaces is established. The sufficient-necessary condition for which it holds is found. Then, the theorem is modified to the shift sampling in shiftinvariant subspaces by using the Zak transform. Finally, some examples are presented to show the generality of the theorem.
منابع مشابه
Supprrium of Perturbation for Sampling in Shift Invariant Subspaces
In the more general framework ' shift invariant subspace", the paper obtains a different estimate of sampling in function subspace to our former work, by using the Frame Theory. The derived formula is easy to be calculated, and the estimate is relaxed in some shift invariant subspaces.
متن کاملShift-Invariant and Sampling Spaces Associated with the Special Affine Fourier Transform
The Special Affine Fourier Transformation or the SAFT generalizes a number of well known unitary transformations as well as signal processing and optics related mathematical operations. Shift-invariant spaces also play an important role in sampling theory, multiresolution analysis, and many other areas of signal and image processing. Shannon’s sampling theorem, which is at the heart of modern d...
متن کاملA sampling theorem on shift-invariant spaces associated with the fractional Fourier transform domain
As a generalization of the Fourier transform, the fractional Fourier transform was introduced and has been further investigated both in theory and in applications of signal processing. We obtain a sampling theorem on shift-invariant spaces associated with the fractional Fourier transform domain. The resulting sampling theorem extends not only the classical Whittaker-Shannon-Kotelnikov sampling ...
متن کاملNON-UNIFORM SAMPLING IN MULTIPLY GENERATED SHIFT-INVARIANT SUBSPACES OF Lp(IR)
Given the samples {f(xj) : j ∈ J} of a function f belonging to a shift invariant subspace of Lp(IR), we give a fast reconstruction algorithm that allows the exact reconstruction of f , as long as the sampling set X = {xj : j ∈ J} is sufficiently dense.
متن کاملNon - Uniform Sampling in Multiplygenerated Shift - Invariant Subspaces
Given the samples ff(x j) : j 2 J g of a function f belonging to a shift invariant subspace of L p (IR d), we give a fast reconstruction algorithm that allows the exact reconstruction of f , as long as the sampling set X = fx j : j 2 J g is suuciently dense.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Signal Processing
دوره 46 شماره
صفحات -
تاریخ انتشار 1998